Optimal dynamic routing for two forklifts in narrow-Aisle racking warehouse
نویسندگان
چکیده
منابع مشابه
Routing order pickers in a warehouse with a middle aisle
This paper considers a parallel aisle warehouse, where order pickers can change aisles at the ends of every aisle and also at a cross aisle halfway along the aisles. An algorithm is presented that can find shortest order picking tours in this type of warehouses. The algorithm is applicable in warehouse situations with up to three aisle changing possibilities. Average tour length is compared for...
متن کاملOptimal routing for dynamic ATFM
In this paper we study the problem of optimal routing in the global context of dynamic ATFM for the European Airspace. The modelling and the algorithms described below have been developed in order to feed with trajectories a global optimization problem in accordance with the column generation technique. However, the method can be used independently to quickly build feasible 4-dimensional trajec...
متن کاملAnalysis of Picker Blocking in Narrow-aisle Batch Picking
This study analyzes impacts by batch picking on picker blocking in narrow-aisle order picking, and determines appropriate batch formations for a better order picking throughput. We present multiple-pick analytical models to offer insights about picker blocking in batch picking. Several simulation studies over a variety of batching situations scrutinize order batching situations which give throu...
متن کاملNarrow Aisle Mobile Robot Navigation in Hazardous Environments
Fast Line Finder (FLF) developed at the University of Massachusetts.13 This algorithm has been used successfully on minicomputers and workstations by its authors and others, including some previous work at Georgia Tech, but for this application it was necessary to port it to a system more suitable for actual deployment on a robot. Routine monitoring of stored radioactive materials can be perfor...
متن کاملOptimal routing in two-queue polling systems
We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times with rate μ in each queue. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science & Technology Development Journal - Engineering and Technology
سال: 2020
ISSN: 2615-9872,2615-9872
DOI: 10.32508/stdjet.v3isi1.719